Parking Functions and Vertex Operators

نویسنده

  • VLADIMIR DOTSENKO
چکیده

We introduce several associative algebras and series of vector spaces associated to these algebras. Using lattice vertex operators, we obtain dimension and character formulae for these spaces. In particular, we a series of representations of symmetric groups which turn out to be isomorphic to parking function modules. We also construct series of vector spaces whose dimensions are Catalan numbers and Fuss–Catalan numbers respectively. Conjecturally, these spaces are related to spaces of global sections of vector bundles on (zero fibres of) Hilbert schemes and representations of rational Cherednik algebras.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tutte polynomial and G-parking functions

Let G be a connected graph with vertex set {0, 1, 2, . . . , n}. We allow G to have multiple edges and loops. In this paper, we give a characterization of external activity by some parameters of G-parking functions. In particular, we give the definition of the bridge vertex of a G-parking function and obtain an expression of the Tutte polynomial TG(x, y) of G in terms of G-parking functions. We...

متن کامل

Connections Between a Family of Recursive Polynomials and Parking Function Theory

In a 2010 paper Haglund, Morse, and Zabrocki studied the family of polynomials ∇Cp1 . . . Cpk1 , where p = (p1, . . . , pk) is a composition, ∇ is the Bergeron-Garsia Macdonald operator and the Ca are certain slightly modified Hall-Littlewood vertex operators. They conjecture that these polynomials enumerate a composition indexed family of parking functions by area, dinv and an appropriate quas...

متن کامل

Orientations, Semiorders, Arrangements, and Parking Functions

It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph G, we define the G-semiorder arrangement and show that the Pak-Stanley labeling of its regions produces all G-parking functions. In his study of Kazhdan-Lusztig cells of the affine Weyl group of typeAn−1, [10], J.-Y. Shi int...

متن کامل

Parking Functions and Acyclic Orientations of Graphs

A. Given an undirected graph G = (V, E), and a designated vertex q ∈ V , the notion of a G-parking function (with respect to q) has recently been developed and studied by various authors. This notion generalizes the classical notion of a parking function associated with the complete graph. In this work, we study properties of certain maximum G-parking functions and relate them, in a bije...

متن کامل

Two Bijections between G-parking Functions and Spanning Trees

For a directed graph G on vertices {0, 1, . . . , n}, a G-parking function is an n-tuple (b1, . . . , bn) of non-negative integers such that, for every non-empty subset U ⊆ {1, . . . , n}, there exists a vertex j ∈ U for which there are more than bj edges going from j to G − U . We construct two bijective maps between the set PG of Gparking functions and the set TG of spanning trees of G rooted...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008